The combinatorics of authentication and secrecy codesSTINSON, D. R.Journal of cryptology. 1990, Vol 2, Num 1, pp 23-49, issn 0933-2790, 27 p.Article

Coding strings by pairs of stringsCHUNG, F. R. K; TARJAN, R. E; PAUL, W. J et al.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 3, pp 445-461, issn 0196-5212Article

A new formulation for the travelling salesman problemCLAUS, A.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 1, pp 21-25, issn 0196-5212Article

Alternate strategies for solving bottleneck assignment problems, analysis and computational resultsDERIGS, U.Computing (Wien. Print). 1984, Vol 33, Num 2, pp 95-106, issn 0010-485XArticle

Probabilistic analysis of bin packing heuristicsHOON LIONG ONG; MAGAZINE, M. J; WEE, T. S et al.Operations research. 1984, Vol 32, Num 5, pp 983-998, issn 0030-364XArticle

Functional iteration and the Josephus problemODLYZKO, A. M; WILF, H. S.Glasgow mathematical journal. 1991, Vol 33, pp 235-240, issn 0017-0895, 6 p., part 2Article

Game of cards, dynamical systems, and a characterization of the floor and ceiling functionsEISELE, P; HADELER, K. P.The American mathematical monthly. 1990, Vol 97, Num 6, pp 466-477, issn 0002-9890, 12 p.Article

A vehicle routing improvement algorithm comparison of a «greedy» and a matching implementation for inventory routingDROR, M; LEVY, L.Computers & operations research. 1986, Vol 13, Num 1, pp 33-45, issn 0305-0548Article

Flexibility in layouts: a simulation approachGUPTA, R. M.Material flow. 1986, Vol 3, Num 4, pp 243-250, issn 0167-1936Article

Invariant sets of arcs in network flow problemsANSTEE, R. P.Discrete applied mathematics. 1986, Vol 13, Num 1, pp 1-7, issn 0166-218XArticle

Worst-case analysis of some heuristics for the m-Salesmen problemHOON LIONG ONG; MOORE, J. B.Material flow. 1985, Vol 2, Num 1, pp 203-209, issn 0167-1936Article

The three-dimensional pallet chart: and analysis of the factors affecting the set of feasible layouts for a class of two-dimensional packing problemsDOWSLAND, K. A.The Journal of the Operational Research Society. 1984, Vol 35, Num 10, pp 895-905, issn 0160-5682Article

An optimal algorithm for the period of a strongly connected digraph = Un algorithme optimal pour la période d'un digraphe fortement connectéPASCOLETTI, A.Information processing letters. 1992, Vol 44, Num 6, pp 313-316, issn 0020-0190Article

Zu den ersten wissenschaftlichen Ergebnissen des Jugendforscherkollektivs «Kombinatorische Optimierung und Reihenfolgeplanung» = About the first scientific results of the young researcher's project «Combinatorial optimization and scheduling»BRAÊSEL, H; WERNER, F.Wissenschaftliche Zeitschrift der Technischen Hochschule Otto von Guericke Magdeburg. 1989, Vol 33, Num 6, pp 38-40, issn 0541-8933, 3 p.Article

New lower planes for the network design problemAHUJA, R. K; MURTY, V. V. S.Networks (New York, NY). 1987, Vol 17, Num 2, pp 113-127, issn 0028-3045Article

Comment on «a perturbation scheme to improve Hillier's solution to the facilities layout problem»KAKU, B. K; THOMPSON, G. L.Management science. 1986, Vol 32, Num 2, pp 251-253, issn 0025-1909Article

Assessment of approximate algorithms: the error measure's crucial roleKRARUP, J; PRUZAN, P.BIT (Nordisk Tidskrift for Informationsbehandling). 1986, Vol 26, Num 3, pp 284-294, issn 0006-3835Article

Network location problems with continuous link demands: p-medians on a chain and 2 medians on a treeCAVALIER, T. M; SHERALI, H. D.European journal of operational research. 1986, Vol 23, Num 2, pp 246-255, issn 0377-2217Article

On the matrix permutation problemTEGZE, M; VLACH, M.Zeitschrift für Operations Research. 1986, Vol 30, Num 3, pp 155-159, issn 0373-790XArticle

An analysis of a decomposition heuristic for the assignment problemAVIS, D; DEVROYE, L.Operations research letters. 1985, Vol 3, Num 6, pp 279-283, issn 0167-6377Article

Ranking scalar products to improve bounds for the quadratic assignment problemRENDL, F.European journal of operational research. 1985, Vol 20, Num 3, pp 363-372, issn 0377-2217Article

On the acyclic subgraph polytopeGROTSCHEL, M; JUNGER, M; REINELT, G et al.Mathematical programming. 1985, Vol 33, Num 1, pp 28-42, issn 0025-5610Article

Partitioning heuristics for two geometric maximization problemsDYER, M. E; FRIEZE, A. M; MCDIARMID, C. J. H et al.Operations research letters. 1984, Vol 3, Num 5, pp 267-270, issn 0167-6377Article

On the decomposability of the stable marriage problemVEKLEROV, E.BIT (Nordisk Tidskrift for Informationsbehandling). 1989, Vol 29, Num 1, pp 41-46, issn 0006-3835Article

Speeding up the Hungarian algorithmWRIGHT, M. B.Computers & operations research. 1989, Vol 17, Num 1, pp 95-96, issn 0305-0548, 2 p.Article